Automata Theory

Constructively formalizing automata theory

We present a constructive formalization of the Myhill-Nerode theorem on the minimization of nite automata that follows the account in Hopcroft and Ullman's book Formal Languages and Their Relation to Automata. We chose to formalize this theorem because it illustrates many points critical to formalization of computational mathematics, especially the extraction of an important algorithm from a pr...

Unambiguity in Automata Theory

Determinism of devices is a key aspect throughout all of computer science, simply because of considerations of efficiency of the implementation. One possible way (among others) to relax this notion is to consider unambiguous machines: non-deterministic machines that have at most one accepting run on each input. In this paper, we will investigate the nature of unambiguity in automata theory, pre...

Finite Automata Theory in

We describe here a development in the system Coq of a piece of Finite Automata Theory. The main result is the Kleene's theorem, expressing that regular expressions and nite automata deene the same languages. From a constructive proof of this result, we automatically obtain a functional program that compiles any regular expression into a nite automata, which constitutes the main part of the impl...

Elements of Automata Theory

CS5236 – Advanced Automata Theory

Advanced Automata Theory is a lecture which will first review the basics of formal languages and automata theory and then give insight into specific topics from the theory of automata theory. In computer science, automata are an important tool for many theoretical results and various types of automata have been used to characterise complexity classes. The lecture will give a deeper understandin...